// Copyright (c) 2009, Michael Patraw
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above copyright
//       notice, this list of conditions and the following disclaimer in the
//       documentation and/or other materials provided with the distribution.
//     * The name of Michael Patraw may not be used to endorse or promote 
//       products derived from this software without specific prior written
//       permission.
//
// THIS SOFTWARE IS PROVIDED BY Michael Patraw ''AS IS'' AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL Michael Patraw BE LIABLE FOR ANY
// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include <cassert>

#include "map.h"

Map::Map(int width, int height) :
data_(NULL), width_(width), height_(height)
{
    data_.resize(width * height);
    clear();
}

Map::~Map()
{
    for (unsigned int i = 0; i < data_.size(); ++i) {
        delete data_[i];
    }
    data_.clear();
}

int Map::getWidth() const
{
    return width_;
}

int Map::getHeight() const
{
    return height_; 
}

const Tile * Map::getTile(int x, int y) const
{
    assert(x >= 0 && x < width_ && y >= 0 && y < height_);
    return data_[y * width_ + x];
}

Tile * Map::tile(int x, int y)
{
    assert(x >= 0 && x < width_ && y >= 0 && y < height_);
    return data_[y * width_ + x];
}

void Map::setTile(int x, int y, Tile * t)
{
    assert(x >= 0 && x < width_ && y >= 0 && y < height_);
    if (data_[y * width_ + x])
        delete data_[y * width_ + x];
    data_[y * width_ + x] = t;
}

void Map::clear()
{
    for (unsigned int i = 0; i < data_.size(); ++i) {
        if (data_[i])
            delete data_[i];
        data_[i] = new Tile(Tile::BLANK);
    }
}
